B21 - Longest Subpalindrome - 競プロ

B21 - Longest Subpalindrome

https://atcoder.jp/contests/tessoku-book/tasks/tessoku_book_ct

提出

code: python

n = int(input())

s = input()

# dprl :=

解答

code: python

n = int(input())

s = input()

# dplr := l 文字目から r 文字目までの部分における最長回文の長さ

dp = [None * n for _ in range(n)]

for i in range(n):

dpii = 1

for i in range(n-1):

if si == si+1:

dpii+1 = 2

else:

dpii+1 = 1

for count in range(2, n):

for l in range(n-count):

r = l + count

if sl == sr:

dplr = max(dplr-1, dpl+1r, dpl+1r-1+2)

else:

dplr = max(dplr-1, dpl+1r)

print(dp0n-1)